finite state automaton meaning in Chinese
有限态自动机
有限自动机
Examples
- Deterministic finite state automaton
决定型有限状态机 - Generalized definition and discussion of some concepts in finite state automata
有限状态自动机中几种概念的泛化定义及探讨 - Based on multiple patterns match algorithm - deterministic finite state automata ( dfsa ) , a dfa has been designed , which can identify multiple kind numbers
摘要基于有限自动机的多模式匹配算法（ dfsa算法） ，设计出同时识别多种数的有限自动机。 - It uses techniques from rule - based reasoning systems , finite state automata , and machine learning to orchestrate complex tasks in a form it calls recipes
它使用基于规则的推理系统，有限状态自动调节器以及机器自我学习等技术，以一个称之为配方的形式来安排各种复杂的任务。 - ( 2 ) based on dfsa algorithm ( deterministic finite state automaton ) and combined with quick search algorithm , this paper analyses and implements a new multi - pattern string match algorithm that consumes less half of memory space of standard dfsa algorithm
该算法是以确定性有限状态自动机( dfsa )为基础，结合quicksearch算法而提出的，可以用来提高主题爬行器的网页分析和web网页分类器的速度。